A Greedy Randomized Adaptive Search for Solving Chance-Constrained U-Shaped Assembly Line Balancing Problem

This paper discusses the U-shaped assembly line balancing problem in case of stochastic processing time. The is formulated using chance-constrained programming and greedy randomized adaptive search procedure used to solve problem. In order prove efficiency proposed algorithm, 71 problems taken from well-known benchmarks are solved compared with theoretical lower bound 13 them were another approach same paper, which beam search. results show that 59 as aspiration bound. addition, 11 2 better than t-test statistics applied showed there no significance difference between algorithm thus, shows when aspired values